One-Dimensional Cutting Stock Optimization with Usable Leftover: A Case of Low Stock-to-Order Ratio
نویسندگان
چکیده
This paper describes a method for solving one-dimensional cutting stock problem with usable leftover (CSPUL) in cases where the ratio between the average stock and average order length is less than 3. The proposed method can solve general CSPUL where standard stock lengths, non-standard stock lengths, or a combination of both are cut in the exact required number of pieces. The solutions of sample problems are compared with other methods.
منابع مشابه
Two-stage two-dimensional guillotine cutting stock problems with usable leftover
In this study we are concerned with the non-exact two-stage two-dimensional guillotine cutting problem considering usable leftovers, in which stock plates remainders of the cutting patterns (non-used material or trim loss) can be used in the future, if they are large enough to fulfill future demands of items (ordered smaller plates). This cutting problem can be characterized as a residual bin-p...
متن کاملThe cutting stock problem and excessive accumulation of usable leftovers
Many methods exist for solving the one-dimensional cutting stock optimization problem with usable leftovers (CSPUL), but none of them consider the excessive generation of usable leftovers (UL) in stock after several consecutiveorders. To highlight this problem, the COLA method for solving the CSPUL [1] was selected. We performed experiments that showed how UL in stock continuously grow when the...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملResolution of the Unidimensional Cutting Stock Problem with Usable Leftover
In this work we consider a one-dimentional cutting stock problem in which the non-used material in the cutting patterns may be used in the future, if large enough. This feature introduces difficulties in comparing solutions of the cutting problem, for example, up to what extent a minimum leftover solution is the most interesting one when the leftover may be used? Some desirable characteristics ...
متن کاملA simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJDSST
دوره 3 شماره
صفحات -
تاریخ انتشار 2011